Sneaking Up On the Hard Problem of Consciousness∗

نویسنده

  • Benjamin Kuipers
چکیده

We discuss several aspects of consciousness — the Easy Problem, the Intentionality Problem, and the Hard Problem — from the pragmatic perspective of artificial intelligence and robotics. Our computational approach is driven by the enormous information content of the sensory stream, and the properties of methods by which an agent may cope with its

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Naturalizing Self-Consciousness

The crucial problem of self-consciousness is how to account for knowing self-reference without launching into a regress or without presupposing self-consciousness rather than accounting for it (circle). In the literature we find two bottom-up proposals for solving the traditional problem: the postulation of nonconceptual forms of self-consciousness and the postulation of a pre-reflexive form of...

متن کامل

A Review of Jeffrey Gray’s Consciousness: Creeping up on the Hard Problem

Jeffrey Gray’s Consciousness: Creeping up on the Hard Problem will be enjoyed by everyone interested in consciousness. Gray, a neuropsychologist, eloquently summarizes significant experimental results on consciousness and, more importantly, explains both how these results interrelate and how they constrain potential theories of consciousness. He also uses these results to build a novel, fascina...

متن کامل

The Meta-Problem of Consciousness

The meta-problem of consciousness is (to a first approximation) the problem of explaining why we think that there is a problem of consciousness.1 Just as metacognition is cognition about cognition, and a metatheory is a theory about theories, the metaproblem is a problem about a problem. The initial problem is the hard problem of consciousness: why and how do physical processes in the brain giv...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

On the correlation/constitution distinction problem (and other hard problems) in the scientific study of consciousness.

OBJECTIVE In the past decade, much has been written about 'the hard problem' of consciousness in the philosophy of mind. However, a separate hard problem faces the scientific study of consciousness. The problem arises when distinguishing the neural correlates of consciousness (NCC) and the neural constitution of consciousness. Here, I explain this correlation/constitution distinction and the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007